A general framework for subexponential discrete logarithm algorithms
نویسندگان
چکیده
منابع مشابه
A General Framework for Subexponential Discrete Logarithm Algorithms
We describe a generic algorithm for computing discrete logarithms in groups of known order in which a smoothness concept is available. The running time of the algorithm can be proved without using any heuristics and leads to a subexponential complexity in particular for nite elds and class groups of number and function elds which were proposed for use in cryptography. In class groups, our algor...
متن کاملGeneric algorithms for the discrete logarithm problem
This can be a significantly harder problem. For example, say we are using a randomized (Las Vegas) algorithm. If β lies in 〈α〉 then we are guaranteed to eventually find logα β, but if not, we will never find it and it may be impossible to tell whether we are just very unlucky or β 6∈ 〈α〉. On the other hand, with a deterministic algorithm such as the baby-steps giant-steps method, we can unequiv...
متن کاملA Discrete Subexponential Algorithm for Parity Games
We suggest a new randomized algorithm for solving parity games with worst case time complexity roughly
متن کاملA general framework for fast stagewise algorithms
Forward stagewise regression follows a very simple strategy for constructing a sequence of sparse regression estimates: it starts with all coefficients equal to zero, and iteratively updates the coefficient (by a small amount ) of the variable that achieves the maximal absolute inner product with the current residual. This procedure has an interesting connection to the lasso: under some conditi...
متن کاملA general framework for shortest path algorithms
In this paper we present a general framework for shortest path algorithms , including amongst others Dijkstra's algorithm and the A* algorithm. By showing that all algorithms are special cases of one algorithm in which some of the nondeterministic choices are made deterministic, termination and correctness can be proved by proving termination and correctness of the root algorithm. Furthermore, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 2002
ISSN: 0065-1036,1730-6264
DOI: 10.4064/aa102-1-6